- mutual exclusion problem
- Программирование: проблема взаимного исключения
Универсальный англо-русский словарь. Академик.ру. 2011.
mutual exclusion problem
Смотреть что такое "mutual exclusion problem" в других словарях:
Mutual exclusion — For the concept, see Mutually exclusive events. mutex redirects here. For the computer program object that negotiates mutual exclusion among threads, see lock (computer science). Mutual exclusion (often abbreviated to mutex) algorithms are used… … Wikipedia
Problem gambling — Classification and external resources ICD 10 F63.0 ICD 9 312.31 … Wikipedia
Dining philosophers problem — In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra… … Wikipedia
Producer-consumer problem — In computer science, the producer consumer problem (also known as the bounded buffer problem) is a classical example of a multi process synchronization problem. The problem describes two processes, the producer and the consumer, who share a… … Wikipedia
Communications protocol — For other senses of this word, see Protocol. A communications protocol is a system of digital message formats and rules for exchanging those messages in or between computing systems and in telecommunications. A protocol may have a formal… … Wikipedia
Dekker's algorithm — is the first known correct solution to the mutual exclusion problem in concurrent programming. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in his manuscript on cooperating sequential processes.[1] It… … Wikipedia
Actor model — In computer science, the Actor model is a mathematical model of concurrent computation that treats actors as the universal primitives of concurrent digital computation: in response to a message that it receives, an actor can make local decisions … Wikipedia
Deadlock — This article is about the computer science concept. For other uses, see Deadlock (disambiguation). A deadlock is a situation where in two or more competing actions are each waiting for the other to finish, and thus neither ever does. It is often… … Wikipedia
Parallel computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Idealism (italian) and after — Italian idealism and after Gentile, Croce and others Giacomo Rinaldi INTRODUCTION The history of twentieth century Italian philosophy is strongly influenced both by the peculiar character of its evolution in the preceding century and by… … History of philosophy
Non-blocking algorithm — In computer science, a non blocking algorithm ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. A non blocking algorithm is lock free if there is guaranteed system wide… … Wikipedia
